Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics
نویسندگان
چکیده
We introduce a new method (derived from model theoretic general combination procedures in automated deduction) for proving fusion decidability in modal systems. We apply it to show fusion decidability in case not only the boolean connectives, but also a universal modality and nominals are shared symbols.
منابع مشابه
The proof theory and semantics of intuitionistic modal logic
Possible world semantics underlies many of the applications of modal logic in computer science and philosophy. The standard theory arises from interpreting the semantic definitions in the ordinary meta-theory of informal classical mathematics. If, however, the same semantic definitions are interpreted in an intuitionistic metatheory then the induced modal logics no longer satisfy certain intuit...
متن کاملA New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics
Previous results for combining decision procedures for the word problem in the non-disjoint case do not apply to equational theories induced by modal logics—which are not disjoint for sharing the theory of Boolean algebras. Conversely, decidability results for the fusion of modal logics are strongly tailored towards the special theories at hand, and thus do not generalize to other types of equa...
متن کاملDecidability for Justification Logics Revisited
Justification logics are propositional modal-like logics that instead of statements A is known include statements of the form A is known for reason t where the term t can represent an informal justification for A or a formal proof of A. In our present work, we introduce model-theoretic tools, namely: filtrations and a certain form of generated submodels, in the context of justification logic in...
متن کاملAn Algebraic Approach to Filtrations for Superintuitionistic Logics
There are two standard model-theoretic methods for proving the finite model property for modal and superintuionistic logics, the standard filtration and the selective filtration. While the corresponding algebraic descriptions are better understood in modal logic, it is our aim to give similar algebraic descriptions of filtrations for superintuitionistic logics via locally finite reducts of Heyt...
متن کاملGames with Second-order Quantiiers Which Decide Propositional Program Logics
The paper demonstrates how second-order quantiication and nite games can be exploited for deciding complicated propositional program logics like the propositional-Calculus with converse (C ?). This approach yields a new proof that C ? is in EXP T IME. Automata-theoretic technique is a very powerful and popular approach for deciding complicated propositional program logics 19, 20, 3]. The rst pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003